'''
Don't Copy This Code, CopyRight . [email protected] © 2022-2023 :)
'''
import sys, threading
sys.setrecursionlimit(2147483647)
input = sys.stdin.readline
def print(*args, end='\n', sep=' ') -> None:
sys.stdout.write(sep.join(map(str, args)) + end)
def Solve():
n = int(input())
ax, ay = list(map(int, input().split()))
bx, by = list(map(int, input().split()))
cx, cy = list(map(int, input().split()))
if bx < ax and by < ay:
if cx > ax or cy > ay:
print("NO")
else:
print("YES")
elif bx < ax and by > ay:
if cx > ax or cy < ay:
print("NO")
else:
print("YES")
elif bx > ax and by < ay:
if cx < ax or cy > ay:
print("NO")
else:
print("YES")
else:
if cx < ax or cy < ay:
print("NO")
else:
print("YES")
if(__name__ == "__main__"):
threading.stack_size(10**8)
threading.Thread(target=Solve).start()#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int ax, ay;
cin>>ax>>ay;
ax--;
ay--;
int bx, by;
cin>>bx>>by;
bx--;
by--;
int cx, cy;
cin>>cx>>cy;
cx--;
cy--;
int x=ax-bx, y=ay-by, z=ax-cx, w=ay-cy;
if (x*z>0&&y*w>0){
cout<<"YES";
}
else{
cout<<"NO";
}
return 0;
}151A - Soft Drinking | 1352A - Sum of Round Numbers |
281A - Word Capitalization | 1646A - Square Counting |
266A - Stones on the Table | 61A - Ultra-Fast Mathematician |
148A - Insomnia cure | 1650A - Deletions of Two Adjacent Letters |
1512A - Spy Detected | 282A - Bit++ |
69A - Young Physicist | 1651A - Playoff |
734A - Anton and Danik | 1300B - Assigning to Classes |
1647A - Madoka and Math Dad | 710A - King Moves |
1131A - Sea Battle | 118A - String Task |
236A - Boy or Girl | 271A - Beautiful Year |
520B - Two Buttons | 231A - Team |
479C - Exams | 1030A - In Search of an Easy Problem |
158A - Next Round | 71A - Way Too Long Words |
160A - Twins | 1A - Theatre Square |
1614B - Divan and a New Project | 791A - Bear and Big Brother |